/*
 *  Copyright 2007-2008 by Matthias Buch-Kromann <mbk.isv@cbs.dk>.
 *  *
 *  This file is part of the Open-source Dependency Toolkit (OSDT),
 *  see http://code.google.com/p/open-source-dependency-toolkit.
 *  
 *  The OSDT is free software: you can redistribute it and/or modify
 *  it under the terms of the GNU Lesser General Public License as published
 *  by the Free Software Foundation, either version 3 of the License,
 *  or (at your option) any later version.
 * 
 *  The OSDT is distributed in the hope that it will be useful,
 *  but WITHOUT ANY WARRANTY; without even the implied warranty of
 *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 *  GNU Lesser General Public License for more details.
 * 
 *  You should have received a copy of the GNU Lesser General Public License
 *  along with the OSDT in the file COPYING and COPYING.LESSER. If not, see
 *  http://www.gnu.org/licenses.
 */

package org.osdtsystem.values;

/**
 * A cost is a real number that measures the badness of the 
 * graph in some respect. The total cost of a graph is defined as the sum
 * of all costs for all functions and locations in the graph. 
 * Given a choice between two graphs, it is always assumed 
 * that a graph with a smaller total cost is preferred over a graph with a larger 
 * total cost. In probabilistic models, the cost is often interpreted as -log10(P)
 * where P is some conditional probability and log10 is the base 10 logarithm. 
 * @author Matthias Buch-Kromann <mbk.isv@cbs.dk>
 */
public class Cost {
    double cost;
    
    public Cost(double cost) {
        this.cost = cost;
    }
}
